The complexity of almost linear diophantine problems
نویسندگان
چکیده
منابع مشابه
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
The linear reachability problem is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using results on minimal solutions (in nonnegative integers) for linear Diophantine systems, we obtain new complexity results for the problem, as well as for other linear counting problems of finit...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولAbout the linear complexity of the almost perfect sequences
We calculate the linear complexity of almost perfect binary sequences. Also we study the linear complexity of binary sequences obtained from series of almost perfect ternary sequences and the ternary sequences with two nonzero autocorrelation sidelobe levels. Key–Words: linear complexity, almost perfect sequences
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولDiophantine Problems with Linear Recurrences via the Subspace Theorem
In this paper we give an overview over recent developments (initiated by P. Corvaja and U. Zannier in [3]) on Diophantine problems where linear recurring sequences are involved and which were solved by using W.M. Schmidt’s Subspace Theorem. Moreover, as a new application, we show: let (Gn) and (Hn) be linear recurring sequences of integers defined by Gn = c1α n 1 + c2α n 2 + · · ·+ ctα t and Hn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1990
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(08)80051-x